منابع مشابه
RANDOM SUBSHIFTS OF FINITE TYPE By Kevin
entropy, and let Bn(X) be its set of words of length n. Define a random subset ω of Bn(X) by independently choosing each word from Bn(X) with some probability α. Let Xω be the (random) SFT built from the set ω. For each 0 ≤ α ≤ 1 and n tending to infinity, we compute the limit of the likelihood that Xω is empty, as well as the limiting distribution of entropy for Xω. For α near 1 and n tending ...
متن کاملThermodynamic Formalism for Random Subshifts of Finite Type
A central role in the thermodynamic formalism of measure preserving transformations is played by the pressure function. For the setup of random dynamical systems (skew-product transformations) we introduce this notion properly and for the special case of random subshifts of nite type we present some equivalent deenitions, which are better to handle. On the basis of these notions we are able to ...
متن کاملSubshifts of Quasi-Finite Type
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise monotonic maps of the interval with positive entropy. Yet many properties remain: existence of finitely many ergodic invariant probabilities of maximum entropy;...
متن کاملAutomorphisms of Z–subshifts of Finite Type
Let (Σ, σ) be a Zd subshift of finite type. Under a strong irreducibility condition (strong specification), we show that Aut(Σ) contains any finite group. For Zd–subshifts of finite type without strong specification, examples show that topological mixing is not sufficient to give any finite group in the automorphism group in general: in particular, End(Σ) may be an abelian semigroup. For an exa...
متن کاملConstructions with Countable Subshifts of Finite Type
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable SFT whose iterated derivatives are maximally complex from the computational point of view, constructions of countable SFTs with high CantorBendixson ranks, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2012
ISSN: 0091-1798
DOI: 10.1214/10-aop636